Finite-Length Bounds for Joint Source-Channel Coding with Markovian Source and Additive Channel Noise to Achieve Large and Moderate Deviation Bounds
نویسندگان
چکیده
We derive novel upper and lower finite-length bounds of the error probability in joint source-channel coding when the source obeys the ergodic Markov process and the channel is a Markovian additive channel or a Markovian conditional additive channel. These bounds achieve the tight bounds in the large and moderate deviation regimes. Index Terms Markov chain, joint source-channel coding, finite-length analysis, large deviation, moderate deviation
منابع مشابه
Large and Moderate Deviations for Joint Source-Channel Coding of Systems With Markovian Memory
We derive novel upper and lower finite length bounds of the error probability in joint source-channel coding when the source is distributed according to an ergodic Markov process and the channel is a Markovian additive channel or a Markovian conditional additive channel. We show that these bounds are tight in the moderate deviations regime and for a certain interval of rates, also in the large ...
متن کاملNon-Asymptotic and Asymptotic Analyses of Information Processing on Markov Chains
We study finite-length bounds for source coding with side information for Markov sources and channel coding for channels with conditional Markovian additive noise. For this purpose, we propose two criteria for finite-length bounds. One is the asymptotic optimality and the other is the efficient computability of the bound. Then, we derive finite-length upper and lower bounds for coding length in...
متن کاملCapacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference
Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios. First, it is shown that the additive Gaussian ch...
متن کاملBounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel
In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...
متن کاملOn the Joint Source-Channel Coding Error Exponent for Discrete Memoryless Systems: Computation and Comparison with Separate Coding
We investigate the computation of Csiszár’s bounds for the joint source-channel coding (JSCC) error exponent, EJ , of a communication system consisting of a discrete memoryless source and a discrete memoryless channel. We provide equivalent expressions for these bounds and derive explicit formulas for the rates where the bounds are attained. These equivalent representations can be readily compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1701.03305 شماره
صفحات -
تاریخ انتشار 2017